Local orientation-preserving symmetry preserving operations on polyhedra
نویسندگان
چکیده
Unifying approaches by amongst others Archimedes, Kepler, Goldberg, Caspar and Klug, Coxeter, Conway, extending on a previous formalization of the concept local symmetry preserving (lsp) operations, we introduce formal definition operations plane graphs that preserve orientation-preserving symmetries, but not necessarily orientation-reversing symmetries. This include, e.g., chiral Goldberg Conway as well all lsp operations. We prove soundness our an invariant which can be used to systematically construct such also show sufficient conditions for operation connectedness graph it is applied.
منابع مشابه
Orientation Preserving Actions on Surfaces
In this article we completely classify orientation preserving actions of groups Z m pk (p is a prime integer) on compact oriented surfaces. 2000 Math. Subj. Class. 57M12, 30F10.
متن کاملLinear maps preserving or strongly preserving majorization on matrices
For $A,Bin M_{nm},$ we say that $A$ is left matrix majorized (resp. left matrix submajorized) by $B$ and write $Aprec_{ell}B$ (resp. $Aprec_{ell s}B$), if $A=RB$ for some $ntimes n$ row stochastic (resp. row substochastic) matrix $R.$ Moreover, we define the relation $sim_{ell s} $ on $M_{nm}$ as follows: $Asim_{ell s} B$ if $Aprec_{ell s} Bprec_{ell s} A.$ This paper characterizes all linear p...
متن کاملOperations Preserving Recognizable Languages
Given a subset S of N, filtering a word a0a1 · · · an by S consists in deleting the letters ai such that i is not in S. By a natural generalization, denote by L[S], where L is a language, the set of all words of L filtered by S. The filtering problem is to characterize the filters S such that, for every recognizable language L, L[S] is recognizable. In this paper, the filtering problem is solve...
متن کاملOperations preserving regular languages
Given a strictly increasing sequence s of non-negative integers, filtering a word a0a1 · · · an by s consists in deleting the letters ai such that i is not in the set {s0, s1, . . .}. By a natural generalization, denote by L[s], where L is a language, the set of all words of L filtered by s. The filtering problem is to characterize the filters s such that, for every regular language L, L[s] is ...
متن کاملPrivacy-Preserving Set Operations
In many important applications, a collection of mutually distrustful parties must perform private computation over multisets. Each party’s input to the function is his private input multiset. In order to protect these private sets, the players perform privacy-preserving computation; that is, no party learns more information about other parties’ private input sets than what can be deduced from t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2021
ISSN: ['1872-681X', '0012-365X']
DOI: https://doi.org/10.1016/j.disc.2020.112156